Real-time Locally Optimal Schedule for Electric Vehicle Load via Diversity-maximization NSGA-II
نویسندگان
چکیده
As distributed energy storage equipments, electric vehicles (EVs) have great potential for applications in power systems. Meanwhile, reasonable optimization of the charging time EVs can reduce users' expense. Thus, schedule EV load requires multi-objective optimization. A diversi-ty-maximization non-dominated sorting genetic algorithm (DM-NSGA) -II is developed to perform by considering profile, cost, and battery degradation. Furthermore, a real-time locally optimal adopted utilizing flexible scale. The case study illustrates that proposed DM-NSGA-II prevent being trapped relatively limited region so as diversify results provide trade-off solutions decision makers. simulation analysis shows variable scale continuously involve present realtime rather than rely on forecasting data. more practical without loss accuracy.
منابع مشابه
Optimal Bespoke CDO Design via NSGA-II
This research work investigates the theoretical foundations and computational aspects of constructing optimal bespoke CDO structures. Due to the evolutionary nature of the CDO design process, stochastic search methods that mimic the metaphor of natural biological evolution are applied. For efficient searching the optimal solution, the nondominating sort genetic algorithm NSGA-II is used, which ...
متن کاملScheduling of Electric Vehicle Charging Station for profit maximization of Vehicles and Station in Uncertainty
Abstract: In this paper, the electric vehicle (EV) charging station scheduling process is designed to maximize the profit of EVs owners and the station operator in two steps. First, a complete model is proposed to formulate the problem of charging and discharging EVs at charging stations in one-day-ahead 24-hours. The purpose of the program is to increase the profits of EVs owners charging stat...
متن کاملA Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...
متن کاملLocally Optimal Load Balancing
This work studies distributed algorithms for locally optimal load-balancing : We are given a graph of maximum degree ∆, and each node has up to L units of load. The task is to distribute the load more evenly so that the loads of adjacent nodes differ by at most 1. If the graph is a path (∆ = 2), it is easy to solve the fractional version of the problem in O(L) communication rounds, independentl...
متن کاملA real-time recursive dynamic model for vehicle driving simulators
This paper presents the Real-Time Recursive Dynamics (RTRD) model that is developed for driving simulators. The model could be implemented in the Driving Simulator. The RTRD can also be used for off-line high-speed dynamics analysis, compared with commercial multibody dynamics codes, to speed up mechanical design process. An overview of RTRD is presented in the paper. Basic models for specific ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of modern power systems and clean energy
سال: 2021
ISSN: ['2196-5420', '2196-5625']
DOI: https://doi.org/10.35833/mpce.2020.000093